A note on the Harris-Kesten Theorem

نویسندگان

  • Béla Bollobás
  • Oliver Riordan
چکیده

A short proof of the Harris-Kesten result that the critical probability for bond percolation in the planar square lattice is 1/2 was given in [1], using a sharp threshold result of Friedgut and Kalai. Here we point out that a key part of this proof may be replaced by an argument of Russo [6] from 1982, using his approximate zero-one law in place of the Friedgut-Kalai result. Russo’s paper gave a new proof of the Harris-Kesten Theorem that seems to have received little attention. Let Z be the planar square lattice, i.e., the graph with vertex set Z in which each pair of nearest neighbours is joined by an edge. Let X = E(Z) be the edge-set of Z, and let Ω = {−1,+1}. We write ω = (ωe)e∈X for an element of Ω, and say that the edge e is open (in the state ω) if ωe = +1, and closed if ωe = −1. An event A ⊂ Ω is local if it depends on only finitely many coordinates. As usual, let Σ be the sigma-field generated by local events, and let Pp be the probability measure on (Ω,Σ) in which each edge is open with probability p, and these events are independent. Let θ(p) be the Pp-probability that the origin is in an infinite open cluster, i.e., an infinite connected subgraph C of Z with every edge of C open. In 1960, Harris [3] proved that θ(1/2) = 0; in 1980, Kesten [5] showed that θ(p) > 0 for p > 1/2, establishing that pc = 1/2 is the ‘critical probability’ for this model. A short proof of these results was given in [1], using a sharp-threshold result of Friedgut and Kalai [2], itself based on a result of Kahn, Kalai and Linial [4]. In 1982, Russo [6] proved a general sharp-threshold result (weaker than the more recent results described above) and applied it to percolation, to give a new proof of the ‘equality of critical probabilities’ for site percolation in Z. Although Russo does not explicitly say this, his application applies equally well to bond percolation, giving a new proof of the Harris-Kesten Theorem that seems not to be well known. Here we shall present Russo’s general sharp-threshold result, and then give a complete version of his application, to bond percolation in Z. Department of Mathematical Sciences, University of Memphis, Memphis TN 38152, USA Trinity College, Cambridge CB2 1TQ, UK Research supported in part by NSF grant ITR 0225610 Royal Society Research Fellow, Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, UK

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Aizenman-Kesten-Newman Theorem

The uniqueness of the infinite open cluster in the setting of bond percolation on the square grid was proven by Harris in 1960 [6]. As shown by Fisher in 1961 [4], Harris’ proof can be extended to include site percolation on the square grid. Aizenman, Kesten, and Newman [1] show that this fact is true in a much more general setting, as well. Let Λ be a connected, infinite, locally-finite, verte...

متن کامل

A short proof of the Harris-Kesten Theorem

We give a short proof of the fundamental result that the critical probability for bond percolation in the planar square lattice Z is equal to 1/2. The upper bound was proved by Harris, who showed in 1960 that percolation does not occur at p = 1/2. The other, more difficult, bound was proved by Kesten, who showed in 1980 that percolation does occur for any p > 1/2.

متن کامل

Sharp thresholds and percolation in the plane

Recently, it was shown in [4] that the critical probability for random Voronoi percolation in the plane is 1/2. As a by-product of the method, a short proof of the Harris-Kesten Theorem was given in [5]. The aim of this paper is to show that the techniques used in these papers can be applied to many other planar percolation models, both to obtain short proofs of known results, and to prove new ...

متن کامل

A note on spectral mapping theorem

This paper aims to present the well-known spectral mapping theorem for multi-variable functions.

متن کامل

A Note on the Descent Property Theorem for the Hybrid Conjugate Gradient Algorithm CCOMB Proposed by Andrei

In [1] (Hybrid Conjugate Gradient Algorithm for Unconstrained Optimization J. Optimization. Theory Appl. 141 (2009) 249 - 264), an efficient hybrid conjugate gradient algorithm, the CCOMB algorithm is proposed for solving unconstrained optimization problems. However, the proof of Theorem 2.1 in [1] is incorrect due to an erroneous inequality which used to indicate the descent property for the s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Eur. J. Comb.

دوره 28  شماره 

صفحات  -

تاریخ انتشار 2007